All-DNA finite-state automata with finite memory.
نویسندگان
چکیده
Biomolecular logic devices can be applied for sensing and nano-medicine. We built three DNA tweezers that are activated by the inputs H(+)/OH(-); ; nucleic acid linker/complementary antilinker to yield a 16-states finite-state automaton. The outputs of the automata are the configuration of the respective tweezers (opened or closed) determined by observing fluorescence from a fluorophore/quencher pair at the end of the arms of the tweezers. The system exhibits a memory because each current state and output depend not only on the source configuration but also on past states and inputs.
منابع مشابه
Reduction of Computational Complexity in Finite State Automata Explosion of Networked System Diagnosis (RESEARCH NOTE)
This research puts forward rough finite state automata which have been represented by two variants of BDD called ROBDD and ZBDD. The proposed structures have been used in networked system diagnosis and can overcome cominatorial explosion. In implementation the CUDD - Colorado University Decision Diagrams package is used. A mathematical proof for claimed complexity are provided which shows ZBDD ...
متن کاملThe Learnability of Simple Deterministic Finite-Memory Automata
The present paper establishes the learnability of simple deterministic finitememory automata via membership and equivalence queries. Simple deterministic finite-memory automata are a subclass of deterministic finite-memory automata introduced by Kaminski and Francez [9] as a model generalizing finite-state automata to infinite alphabets. For arriving at a meaningful learning model we first prov...
متن کاملOn Weakly Invertible Semi - input - memory Finite Automata with Delay 2
Semi-input-memory finite automata are a generalization of input-memory finite automata by appending an autonomous finite automaton component. This paper gives a decision criterion of weakly invertible semi-input-memory finite automata with delay 2 of which the minimal output weight of length 2 and the sizes of input and output alphabets are identical. The results are used to generate a kind of ...
متن کاملLimitations of Unary Finite Automata
NFA (Non-deterministic Finite Automata) usually require significantly less states than DFA (Deterministic Finite Automata) to recognize the same language. The power of NFA lies in its ability to be in many states simultaneously (i.e., in a subset of its state set). The usage of one letter input alphabet puts some restrictions on this ability of NFAs and decreases the gap between NFAs and DFAs. ...
متن کاملUse of information, memory and randomization in asynchronous gathering
We investigate initial information, unbounded memory and randomization in gathering mobile agents on a grid. We construct a state machine, such that it is possible to gather, with probability 1, all configurations of its copies. This machine has initial input, unbounded memory, and is randomized. We show that no machine having any two of these capabilities but not the third, can be used to gath...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Proceedings of the National Academy of Sciences of the United States of America
دوره 107 51 شماره
صفحات -
تاریخ انتشار 2010